Motion video predict coding method, motion video predict coding device, motion video predict coding program, motion video predict decoding method, motion predict decoding device, and motion video predict decoding program

ABSTRACT

A video predictive coding system includes a video predictive encoding device having: an input circuit to receive pictures constituting a video sequence; an encoding circuit which conducts predictive coding of a target picture using, as reference pictures, pictures encoded and reconstructed in the past, to generate compressed picture data; a reconstruction circuit to decode the compressed picture data to reconstruct a reproduced picture; picture storage to store the reproduced picture as a reference picture for encoding of a subsequent picture; and a buffer management circuit which controls the picture storage, (prior to predictive encoding of the target picture), on the basis of buffer description information BD[k] related to reference pictures used in predictive encoding of the target picture, encodes the buffer description information BD[k] with reference to buffer description information BD[m] for a picture different from the target picture, and adds encoded data thereof to the compressed picture data.

This application is a continuation of U.S. application Ser. No.15/473,849, filed Mar. 30, 2017, which is a continuation of U.S.application Ser. No. 15/251,876, filed Aug. 30, 2016, which is acontinuation of U.S. application Ser. No. 14/255,728, filed Apr. 17,2014, which is a continuation of PCT/JP2012/073090, filed Sep. 10, 2012,which claims the benefit of the filing date pursuant to 35 U.S.C. §119(e) of JP2011-228758, filed Oct. 18, 2011 and JP2011-240334, filedNov. 1, 2011, all of which are incorporated herein by reference.

TECHNICAL FIELD

The present disclosure relates to a video predictive encoding method,device and program, and a video predictive decoding method, device andprogram, and more particularly, to a description in a buffer forreference pictures to be used in inter-frame predictive encoding.

BACKGROUND ART

Compression coding technologies are used for efficient transmission andstorage of video data. The techniques defined in MPEG-1 to 4 and ITU(International Telecommunication Union) H.261 to H.264 are commonly usedfor video data.

SUMMARY

Using encoding techniques, a picture which is used as an encoding targetis divided into a plurality of blocks and then an encoding process and adecoding process are carried out on a block basis. Predictive encodingmethods as described below are used in order to improve encodingefficiency. In intra-frame predictive encoding, a predicted signal isgenerated using a previously-reproduced neighboring picture signal (areconstructed signal reconstructed from picture data compressed in thepast) present in the same frame as a target block, and then a residualsignal obtained by subtracting the predicted signal from a signal of thetarget block is encoded. In inter-frame predictive encoding, adisplacement of signal is searched for with reference to apreviously-reproduced picture signal present in a frame different from atarget block, a predicted signal is generated with compensation for thedisplacement, and a residual signal obtained by subtracting thepredicted signal from the signal of the target block is encoded. Thepreviously-reproduced picture used for reference for the motion searchand compensation is referred to as a reference picture.

In inter-frame predictive encoding, such as, for example, in H.264, thepredicted signal for the target block is selected by performing themotion search with reference to a plurality of reference pictures havingbeen encoded and then reproduced in the past, and defining a picturesignal with the smallest error as an optimum predicted signal. Adifference is calculated between the pixel signal of the target blockand this optimum predicted signal, which is then subjected to a discretecosine transform, quantization, and entropy encoding. At substantiallythe same time, also encoded is information about the reference picturefrom which the optimum predicted signal for the target block is derived(which will be referred to as “reference index”) and information aboutthe region of the reference picture from which the optimum predictedsignal is derived (which will be referred to as “motion vector”). InH.264, for example, reproduced pictures are stored as four to fivereference pictures in a frame memory or reproduced picture buffer (ordecoded picture buffer, which can also be referred to as “DPB”).

A general method for management of a plurality of reference pictures isa technique of releasing, from the buffer, a region occupied by theoldest reference picture (i.e., a picture having been stored in thebuffer for the longest time) out of a plurality of reproduced pictures,and storing a reproduced picture having been decoded last, as areference picture. On the other hand, a reference picture managementmethod, such as the example method described in Rickard Sjoberg, JonatanSamuelsson, “Absolute signaling of reference pictures,” JointCollaborative Team on Video Coding, JCTVC-F493, Torino, 2011 may be usedto flexibly prepare optimum reference pictures for a target picture, inorder to enhance efficiency of inter-frame prediction.

Buffer description information to describe a plurality of referencepictures to be stored in the buffer can be added to encoded data of eachtarget picture, and can then be encoded, such as in an example describedby Rickard Sjoberg, Jonatan Samuelsson, “Absolute signaling of referencepictures,” Joint Collaborative Team on Video Coding, JCTVC-F493, Torino,2011. Identifiers of the reference pictures necessary for processing(encoding or decoding) of the target picture and subsequent pictures canbe described in this buffer description information. In an encodingdevice or a decoding device, the buffer can be managed so thatdesignated reproduced pictures are stored in the buffer (frame memory),in accordance with the buffer description information. On the otherhand, any reproduced picture not designated can be deleted from thebuffer.

The buffer description information about each target picture may be sentby being added to the header of compressed data of each target picture,or pieces of buffer description information about a plurality of targetpictures may be sent together as part of a PPS (picture parameter set)information carrying parameters of the decoding process applied incommon. FIG. 15 is a schematic diagram showing an example of bufferdescription information described in a PPS. Although the PPS containsinformation other than the buffer description information, the otherinformation is omitted herein. Described in the PPS information 1510 arethe number 1511 of buffer descriptions (each of which will also bereferred to hereinafter as “BD”), and pieces of information (1520, 1522,1524) about the BDs as many as the number. Described in the informationabout each BD (the k-th BD will be referred to as BD[k]) are the number1530 of reference pictures stored in the buffer, and information (1531,1532) to identify which reference picture is to be stored. Informationused to identify each reference picture is a POC (picture output count)indicative of an order of output of the picture to the outside.Described herein instead of direct use of the POC number is ΔPOC_(k,j)(the j-th component in the k-th BD) which is a difference between thePOC number of the reference picture and the POC number of the processingtarget picture. Also sent is D_ID_(k,j), which is indicative ofdependence of the reference picture on other pictures. The smaller thevalue of D_ID_(k,j), the more pictures for which reproduction isdependent on the reference picture; on the other hand, the larger thisvalue, the smaller the influence on other pictures. If D_ID_(k,j) of areference picture is the largest value, the reference picture is notneeded for reproduction of other pictures and therefore does not have tobe stored as a reference picture. In an example, conventional technologycan be configured to send the buffer description BD[k] in the form ofthe information of the value (#ΔPOC_(k)) indicative of the number ofreference pictures and {ΔPOC_(k,j), D_ID_(k,j)} for each of the numberof reference pictures, from the transmission side to the reception side.

FIG. 16 shows an example of a state of target pictures and referencepictures in the buffer DPB in processing of the respective targetpictures. A POC number to identify a picture is written in each cell.For example, row 1610 means that in processing (encoding or decoding) ofa target picture with POC=32, reference pictures with POC=18, 20, 22,and 24 are stored in the DPB. FIG. 17 shows an example of bufferdescription information obtained by applying, for example, conventionaltechnology to the state of target pictures and reference pictures in thebuffer DPB of FIG. 16. Each of cells under 1704 indicates a value ofΔPOC_(k,j).

In video encoding and decoding, reference can be made to an identicalpicture by a plurality of target pictures. In other words, the samereference picture can be used multiple times (repeatedly). It is seenfrom FIG. 16 that the reference picture with POC=32 enclosed in dashedline 1603 is referenced by the target pictures with POC=28, 26, 30, 25,27, 29, and 31. It is also seen from the values in the respective cellsunder 1602 in FIG. 16 that the reference pictures with POC=22, 24, 28,26, and 30 are also used multiple times.

In the buffer description information based on an example ofconventional technology, however, ΔPOC_(k,j) is independently determinedin each BD[k], and for this reason, even for the same reference picture,ΔPOC_(k,j) thereof is described in each BD[k]; therefore, the sameinformation must be repeatedly transmitted and received, in spite of itbeing the same as previously transmitted and received information. Thiswill be explained using the example of FIG. 16 and FIG. 17. The valuesin the respective cells enclosed in dashed line 1705 correspond to thePOC numbers of the respective cells enclosed in dashed line 1603 in FIG.16. Although the values in dashed line 1603 all represent the referencepicture with POC=32, the values of ΔPOC_(k,j) in dashed line 1705 allare different. Since these values of ΔPOC_(k,j) are largely different,it is necessary to encode them using many bits. Therefore, an exampleconventional technology may have a problem that the same information hasto be repeatedly transmitted and received using many bits, in order totransmit the buffer description information.

A video predictive coding system includes a video predictive encodingdevice comprising: input means which implements input of a plurality ofpictures constituting a video sequence; encoding means which conductspredictively coding of a target picture to generate compressed picturedata, using, as reference pictures, a plurality of pictures which havebeen encoded and then decoded and reproduced in the past; reconstructionmeans which decodes the compressed picture data to reconstruct areproduced picture; picture storage means which stores at least oneaforementioned reproduced picture as a reference picture to be used forencoding of a subsequent picture; and buffer management means whichcontrols the picture storage means, wherein (prior to processing of thetarget picture), the buffer management means controls the picturestorage means on the basis of buffer description information BD[k]relating to a plurality of reference pictures to be used in predictiveencoding of the target picture and, at substantially the same time, thebuffer management means encodes the buffer description informationBD[k], with reference to buffer description information BD[m] foranother picture different from the target picture, and thereafter addsthe encoded data thereof to the compressed picture data.

Furthermore, the video predictive coding system includes a videopredictive decoding device comprising: input means which implementsinput of compressed picture data for each of a plurality of picturesconstituting a video sequence, the compressed picture data containingdata resulting from predictive coding using a plurality of referencepictures, which have been decoded and reproduced in the past, andencoded data of buffer description information BD[k] related to theplurality of reference pictures; reconstruction means which decodes thecompressed picture data to reconstruct a reproduced picture; picturestorage means which stores at least one aforementioned reproducedpicture as a reference picture to be used for decoding of a subsequentpicture; and buffer management means which controls the picture storagemeans, wherein (prior to reconstruction of the reproduced picture), thebuffer management means decodes the encoded data of the bufferdescription information BD[k] for the reproduced picture, with referenceto buffer description information BD[m] for another picture differentfrom the reproduced picture, and then controls the picture storage meanson the basis of the decoded buffer description information BD[k].

The encoding and decoding methods of the buffer description informationaccording to the video predictive coding system make use of the propertyof repeatedly using the same reference picture in the predictiveencoding and decoding processes for a plurality of pictures, so as touse the correlation between pieces of buffer description informationBD[k] used for different pictures, in order to reduce redundantinformation, thereby achieving the effect of efficient encoding of thebuffer description information. In addition, the information specific toeach reference picture (dependence information) can be the same as thatof the referenced picture and therefore the information can be inheritedas it is, thereby achieving the advantage of no need for encoding anddecoding it again.

Other systems, methods, features and advantages will be, or will become,apparent to one with skill in the art upon examination of the followingfigures and detailed description. It is intended that all suchadditional systems, methods, features and advantages be included withinthis description, be within the scope of the disclosure, and beprotected by the following claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The video predictive coding system, may be better understood withreference to the following drawings and description. The components inthe figures are not necessarily to scale, emphasis instead being placedupon illustrating the principles of the system. Moreover, in thefigures, like referenced numerals designate corresponding partsthroughout the different views.

FIG. 1 is a block diagram showing an example of a video predictiveencoding device according to an embodiment of the predictive videocoding system.

FIG. 2 is a block diagram showing an example of a video predictivedecoding device according to an embodiment of the predictive videocoding system.

FIG. 3 is a flowchart showing an example of a buffer management methodin the video predictive encoding device according to an embodiment.

FIG. 4 is a flowchart showing an example of a buffer management methodin the video predictive decoding device according to an embodiment.

FIG. 5 is a table showing an example of buffer description informationgenerated by the buffer management method used in an embodiment.

FIG. 6 is a flowchart showing an example encoding process of bufferdescription information in the video predictive encoding deviceaccording to an embodiment.

FIG. 7 is a flowchart showing an example decoding process of bufferdescription information in the video predictive decoding deviceaccording to an embodiment.

FIG. 8 is a schematic diagram showing an example of the bufferdescription information described in a PPS generated by an embodiment.

FIG. 9 is another example showing a state of target pictures andreference pictures in the buffer DPB in processing of the respectivetarget pictures.

FIG. 10 is a flowchart showing an example encoding process of bufferdescription information in the video predictive encoding deviceaccording to an embodiment related to the example of FIG. 9.

FIG. 11 is a flowchart showing an example decoding process of bufferdescription information in the video predictive decoding deviceaccording to an embodiment related to the example of FIG. 9.

FIG. 12 is a schematic diagram showing an example of the bufferdescription information described in a PPS generated by an embodimentrelated to the example of FIG. 9.

FIG. 13 is a drawing showing an example hardware configuration of acomputer.

FIG. 14 is a perspective view of an example computer.

FIG. 15 is a schematic diagram showing an example of buffer descriptioninformation described in a PPS.

FIG. 16 is an example showing a state of target pictures and referencepictures in the buffer DPB in processing of the respective targetpictures.

FIG. 17 is a table showing an example of the buffer descriptioninformation obtained from the example of FIG. 16.

FIG. 18 is a flowchart showing an example process of directly encodingPOC numbers of the buffer description information in the videopredictive encoding device according to an embodiment.

FIG. 19 is a flowchart showing an example process of directly decodingPOC numbers of the buffer description information in the videopredictive decoding device according to an embodiment.

FIG. 20 is a table showing an example of buffer description informationobtained from the example of FIG. 9.

FIG. 21 is a table showing an example of the buffer descriptioninformation obtained from the example of FIG. 20, based on a buffermanagement method used in an embodiment.

FIG. 22 is a flowchart showing another example implementation methoddifferent from the process of FIG. 6 about the encoding process ofbuffer description information in the video predictive encoding deviceaccording to an embodiment.

FIG. 23 is a flowchart showing another example implementation methoddifferent from the process of FIG. 7 about the decoding process ofbuffer description information in the video predictive decoding deviceaccording to an embodiment.

FIG. 24 is a schematic diagram showing an example of the bufferdescription information described in a PPS generated by the encodingprocess of buffer description information by an embodiment based on FIG.22.

DESCRIPTION OF EMBODIMENTS

Embodiments of the video predictive coding system will be describedbelow using FIGS. 1 to 24. FIG. 1 is a block diagram showing an examplevideo predictive encoding device 100 according to an embodiment. Asshown in FIG. 1, the video predictive encoding device 100 is providedwith circuitry that includes an input terminal 101, a block divisionunit 102, a predicted signal generation unit 103, a frame memory (orbuffer, which will also be referred to as DPB) 104, a subtraction unit105, a transform unit 106, a quantization unit 107, an inversequantization unit 108, an inverse transform unit 109, an addition unit110, an entropy encoding unit 111, an output terminal 112, and a buffermanagement unit 114. The subtraction unit 105, transform unit 106, andquantization unit 107 can correspond to an encoding unit or circuit. Theinverse quantization unit 108, inverse transform unit 109, and additionunit 110 can correspond to a reconstruction unit or circuit. As usedherein, the term “unit” may be interchangeable with the term “circuit”to describe hardware that may also use software to perform the describedfunctionality. The video predictive coding device 100 may be a computingdevice or computer, including circuitry in the form of hardware, or acombination of hardware and software, capable of performing thedescribed functionality. The video predictive coding device 100 may beone or more separate systems or devices included in the video predictivecoding system, or may be combined with other systems or devices withinthe video predictive coding system. In other examples, fewer oradditional blocks may be used to illustrate the functionality of thepredictive video encoding device 100.

An example of the operation of the video predictive encoding device 100will be described. A video signal consisting of a plurality of picturescan be fed to the input terminal 101. A picture of an encoding target isdivided into a plurality of regions by the block division unit 102. Inan embodiment, the target picture is divided into blocks each consistingof 8×8 pixels, but it may be divided into blocks of any size or shapeother than the foregoing in other embodiments. A predicted signal isthen generated for a region as a target of an encoding process (whichwill be referred to hereinafter as a target block). The embodiment canemploy two types of prediction methods, the inter-frame prediction andthe intra-frame prediction.

In an example of the inter-frame prediction, reproduced pictures havingbeen encoded and thereafter reconstructed in the past are used asreference pictures and motion information to provide the predictedsignal with the smallest difference from the target block is determinedfrom the reference pictures. Depending upon situations, it is alsoallowable to subdivide the target block into sub-regions and determinean inter-frame prediction method for each of the sub-regions. In thiscase, an example efficient division method for the entire target blockand motion information of each sub-region can be determined by variousdivision methods. In an embodiment, the operation is carried out in thepredicted signal generation unit 103, the target block is fed via lineL102, and the reference pictures are fed via L104. The referencepictures to be used herein are a plurality of pictures which have beenencoded and reconstructed in the past. An example of the details of thereconstruction and encoding are similar to the method of H.264 which isan example of conventional technology. The motion information andsub-region division method determined as described above are fed vialine L112 to the entropy encoding unit 111 to be encoded thereby andthen the encoded data is output from the output terminal 112.Information (reference index) indicative of which reference picture fromamong the plurality of reference pictures the predicted signal isderived is also sent via line L112 to the entropy encoding unit 111. Inan embodiment, three to six reproduced pictures are stored in the framememory 104 to be used as reference pictures. The predicted signalgeneration unit 103 derives reference picture signals from the framememory 104, based on the reference pictures and motion information,which correspond to the sub-region division method and each sub-region,and generates the predicted signal. The inter-frame predicted signalgenerated in this manner is fed via line L103 to the subtraction unit105.

In the intra-frame prediction, an intra-frame predicted signal isgenerated using previously-reproduced pixel values spatially adjacent tothe target block. Specifically, the predicted signal generation unit 103derives previously-reproduced pixel signals in the same frame as thetarget block from the frame memory 104 and extrapolates these signals togenerate the intra-frame predicted signal. The information about themethod of extrapolation is fed via line L112 to the entropy encodingunit 111 to be encoded thereby and then the encoded data is output fromthe output terminal 112. The intra-frame predicted signal generated inthis manner is fed to the subtraction unit 105. The method of generatingthe intra-frame predicted signal in the predicted signal generation unit103 can be, for example, similar to the method of H.264, which is anexample of conventional technology. The predicted signal with thesmallest difference is selected from the inter-frame predicted signaland the intra-frame predicted signal obtained as described above, andthe selected predicted signal is fed to the subtraction unit 105.

The subtraction unit 105 subtracts the predicted signal (fed via lineL103) from the signal of the target block (fed via line L102) togenerate a residual signal. This residual signal is transformed by adiscrete cosine transform by the transform unit 106 and the resultingtransform coefficients are quantized by the quantization unit 107.Finally, the entropy encoding unit 111 encodes the quantized transformcoefficients and the encoded data is output along with the informationabout the prediction method from the output terminal 112.

For the intra-frame prediction or the inter-frame prediction of thesubsequent target block, the compressed signal of the target block issubjected to inverse processing to be reconstructed. For example, thequantized transform coefficients are inversely quantized by the inversequantization unit 108 and then transformed by an inverse discrete cosinetransform by the inverse transform unit 109, to reconstruct a residualsignal. The addition unit 110 adds the reconstructed residual signal tothe predicted signal fed via line L103 to reproduce a signal of thetarget block and the reproduced signal is stored in the frame memory104. The present embodiment employs the transform unit 106 and theinverse transform unit 109, but it is also possible to use othertransform processing instead of these transform units. In somesituations, the transform unit 106 and the inverse transform unit 109may be omitted.

The frame memory 104 is a finite storage, and storage of all reproducedpictures is beyond the scope of this discussion. Accordingly, onlyreproduced pictures to be used in encoding of the subsequent picture aredescribed as being stored in the frame memory 104. A unit to controlthis frame memory 104 is the buffer management unit 114. Input datawhich is received through an input terminal 113 includes: informationindicative of an output order of each picture (POC, picture outputcount), dependence information (dependency ID) related to D_ID_(k,j)which is indicative of dependence on the picture in predictive encodingof other pictures, and a type of encoding of the picture (intra-framepredictive encoding or inter-frame predictive encoding); and the buffermanagement unit 114 operates based on this information. Bufferdescription information generated by the buffer management unit 114 andthe POC information of each picture is fed via line L114 to the entropyencoding unit 111 to be encoded thereby, and the encoded data is outputtogether with the compressed picture data. The processing method of thebuffer management unit 114 will be described later.

Next, a video predictive decoding method of the predictive video codingsystem will be described. FIG. 2 is a block diagram of an example of avideo predictive decoding device 200 according to an embodiment thepredictive video coding system. As shown in FIG. 2, the video predictivedecoding device 200 is provided with circuitry that includes an inputterminal 201, a data analysis unit 202, an inverse quantization unit203, an inverse transform unit 204, an addition unit 205, a predictedsignal generation unit 208, a frame memory 207, an output terminal 206,and a buffer management unit 209. The inverse quantization unit 203 andthe inverse transform unit 204 can correspond to a “reconstructioncircuit”. The reconstruction circuit may be means other than the above.Furthermore, the inverse transform unit 204 may be omitted. The videopredictive decoding device 200 may be a computing device or computer,including circuitry in the form of hardware, or a combination ofhardware and software, capable of performing the describedfunctionality. The video predictive decoding device 200 may be one ormore separate systems or devices included in the video predictive codingsystem, or may be combined with other systems or devices within thevideo predictive coding system. In other examples, fewer or additionalblocks may be used to illustrate the functionality of the predictivevideo decoding device 200.

Concerning the video predictive decoding device 200 configured asdescribed above, an example of the operation thereof will be describedbelow. Compressed data resulting from compression encoding by theaforementioned method is input through the input terminal 201. Thiscompressed data contains the residual signal resulting from predictiveencoding of each target block obtained by division of a picture into aplurality of blocks, and the information related to the generation ofthe predicted signal. The information related to the generation of thepredicted signal includes the information about block division (size ofblock), the motion information, and the aforementioned POC informationin the case of the inter-frame prediction, and includes the informationabout the extrapolation method from previously-reproduced surroundingpixels in the case of the intra-frame prediction. The compressed dataalso contains the buffer description information for control of theframe memory 207.

The data analysis unit 202 extracts the residual signal of the targetblock, the information related to the generation of the predictedsignal, the quantization parameter, and the POC information of thepicture from the compressed data. The residual signal of the targetblock is inversely quantized on the basis of the quantization parameter(fed via line L202) by the inverse quantization unit 203. The result istransformed by the inverse transform unit 204 using an inverse discretecosine transform.

Next, the information related to the generation of the predicted signalis fed via line L206 b to the predicted signal generation unit 208. Thepredicted signal generation unit 208 accesses the frame memory 207,based on the information related to the generation of the predictedsignal, to derive a reference signal from a plurality of referencepictures to generate a predicted signal. This predicted signal is fedvia line L208 to the addition unit 205, the addition unit 205 adds thispredicted signal to the reconstructed residual signal to reproduce atarget block signal, and the signal is output via line L205 andsimultaneously stored into the frame memory 207.

Reproduced pictures to be used for decoding and reproduction of thesubsequent picture are stored in the frame memory 207. The buffermanagement unit 209 controls the frame memory 207. The buffer managementunit 209 operates based on the buffer description information and thepicture encoding type fed via line L206 a. A control method of thebuffer management unit 209 according to embodiments of the predictivevideo coding system will be described later.

Next, example operations of the buffer management unit (114 in FIG. 1and 209 in FIG. 2) will be described using FIGS. 3 and 4. The buffermanagement unit according to an embodiment manages the referencepictures stored in the frame memory (104, 207), in the following manner.For example, the encoder side generates pieces of buffer descriptioninformation for respective target pictures together and sends them aspart of PPS (picture parameter set) information carrying parameters ofthe decoding process applied in common. The decoder side extracts fromthe PPS information the pieces of buffer description information senttogether, and performs the decoding and reproduction processing afterpreparing reference pictures in the frame memory, based on one piece ofbuffer description information designated in compressed data of eachtarget picture. Any reference picture not described in the bufferdescription information is deleted from the frame memory and cannot beused as a reference picture thereafter.

FIG. 3 shows an example method of encoding the buffer descriptioninformation in the buffer management unit 114 of the video predictiveencoding device 100 according to an embodiment, which is a method forencoding pieces of buffer description information together forrespective target pictures. In the present specification, a bufferdescription is represented by BD (buffer description) and BD[k]indicates information about the k-th BD. FIG. 8 shows a schematicdiagram of an example of buffer description information described in aPPS generated according to an embodiment.

In FIG. 3 step 310 is to set a counter k to zero. Step 320 is to encodethe total number of all BDs described in the PPS information. Thisnumber corresponds to 811 in FIG. 8. Step 330 is to encode informationabout BD[0] which is the first BD. 820 in FIG. 8 indicates theinformation of BD[0]. #ΔPOC₀ (830) indicates the number of components ofBD[0], i.e., the number of reference pictures needed. The information ofBD[0] herein contains not only the reference pictures needed forencoding and decoding of the target picture, but also reference picturesthat are not referenced in the processing for the target picture but arereferenced in the encoding and decoding processing for subsequentpictures thereto, and, for this reason, the number of such referencepictures is also counted in #ΔPOC₀.

Subsequently, information about the reference pictures to be used (831,832, . . . ) is described. In the present embodiment{ΔPOC_(0,i)D_ID_(0,i)} is described as the information about thereference pictures. The index i represents the i-th component of BD[0].ΔPOC_(0,i) is a difference value between a POC number of the i-threference picture and a POC number of the target picture that usesBD[0], and D_ID_(0,i) dependence information of the i-th referencepicture.

The information about BD[k] except for BD[0] is predictively encodedwith reference to the buffer information BD[m] appearing before it (step360). The present embodiment employs m=k−1, but reference can be made toany BD[m] as long as m<k. The information contained in BD[k] where k>0is exemplified by 822 and 824 in FIG. 8. The contents described thereininclude the number of components of BD[k] (which corresponds to thenumber of reference pictures needed for the target picture andsubsequent pictures) #ΔPOC_(k) (833, 839), ΔBD_(k) (834, 840), and,Δidx_(k,i) (835, 836, 837, 841, 842, 843, 844) or {Δidx_(k,i),D_ID_(k,i)} (838). The details of these transmitted data (syntaxes) willbe described later. After every BD[k] is encoded, it is sent as part ofthe PPS information together with other compressed data. In encodingeach picture, the buffer management unit 114 prepares the referencepictures in the frame memory 104, based on one piece of bufferdescription information BD[k] designated via the input terminal 113 inFIG. 1, and then the encoding process is carried out. On the receiverside, the buffer management unit 209 prepares the reference pictures inthe frame memory 207, based on the identifier k of the bufferdescription added to the header of the compressed data of each picture,and then the decoding process is carried out.

FIG. 4 is a flowchart showing an example method of decoding the bufferdescription information in the buffer management unit 209 of the videopredictive decoding device 200 according to an embodiment. The dataanalysis unit 202 extracts the data about the buffer descriptioninformation from the PPS information and feeds the data to the buffermanagement unit 209. Step 420 is to first decode the number of BDs. Step430 is to decode the information about BD[0] which is the first BD. Theinformation about BD[k] where k>0 is predictively decoded with referenceto the buffer description BD[m] appearing before it (step 460). Asdescribed above, the present embodiment employs m=k−1. The bufferdescription information resulting from decoding of every BD[k] is storedin the buffer management unit 209. In decoding each picture, the buffermanagement unit 209 prepares the reference pictures in the frame memory207, based on one piece of buffer description information BD[k]designated in the compressed data, and then the decoding andreproduction processing is carried out.

The buffer description (BD[k], k>0) shown in FIG. 8 can be sentefficiently. According to the present embodiment, using BD[k] as atarget and BD[m] for the prediction of the target satisfies thefollowing conditions.

(a) At least some of the reference pictures described in BD[k] are thosealready described in BD[m].(b) N pictures which are newly encoded or decoded in addition to thosein (a) (above) are described as “additional reference pictures” inBD[k]. The number N herein is an integer of not less than 0.Furthermore, more preferred modes satisfy the following conditions.(c) m=(k−1); that is, the immediately previous BD in the bufferdescription information is used for the prediction.(d) The number of additional reference pictures described in above (b)is only one (N=1). This one additional reference picture is preferably apicture generated in the process using BD[m].

The above-described conditions will be described using the example ofFIG. 16. Column 1601 in FIG. 16 represents the POC number of each targetpicture as a target of the encoding or decoding process. The POC numbersof respective target pictures are arranged in order from top, in theorder of the encoding or decoding process. For example, after thepicture with POC=32 is encoded or decoded, the picture with POC=28 isencoded or decoded. Furthermore, the POC numbers of reference pictures(plural pictures) to be used in execution of the encoding or decodingprocess of each target picture are described in respective cells undercolumn 1602.

The information about the reference pictures used for encoding ordecoding/reproduction of the target picture (1610) with POC=32 isencoded as BD[0] using the syntax of 820 in FIG. 8. In this case,#ΔPOC₀=4 and the reference pictures with the POC numbers of 18, 20, 22,and 24 are encoded as ΔPOC_(0,i). The values of ΔPOC_(0,i) are thevalues in i=0,1,2,3 in row 1710 in FIG. 17, and each value is obtainedfrom a difference between the POC number of the reference picture andthe POC number of the target picture.

The information about the reference pictures described in rows 1611 to1617 in FIG. 16 is encoded as BD[k], k>0, using the syntaxes of 822, 824in FIG. 8. Row 1611 corresponds to k=1 and indicates information aboutthe POC numbers of the reference pictures to be used for the targetpicture with POC=28. The POC numbers (22, 24, 32) from this informationare converted to difference values ΔPOC_(1,i). The resulting values aregiven as values in i=0,1,2 in row 1711 in FIG. 17. In embodiments, thesevalues of ΔPOC_(1,i) are predictively encoded with reference toΔPOC_(0,i) (the values in i=0,1,2,3 in row 1710).

The predictive encoding method of buffer description information will bedescribed. Let BD[k] be the buffer description information as a targetand BD[m] be the buffer description information for the prediction ofBD[k]. Furthermore, let POC_(current) be the POC number of the targetpicture using the information of BD[k] and POC_(previous) be the POCnumber of the target picture using the information of BD[m]. Inaddition, let POC_(k,i) be the POC number of the i-th reference pictureof BD[k] and POC_(m,j) be the POC number of the j-th reference pictureof BD[m]. In this case the difference values ΔPOC_(k,i) and ΔPOC_(m,j)are given as follows.

ΔPOC_(k,i)=POC_(k,i)−POC_(current)   (1)

ΔPOC_(m,j)=POC_(m,j)−POC_(previous)   (2)

ΔPOC_(k,i) is encoded using ΔPOC_(m,j) as a predictive value. Forexample, the following relation holds.

$\begin{matrix}\begin{matrix}{{{\delta \; {POC}_{k,i}} - {\Delta \; {POC}_{m,j}}} = {\left( {{POC}_{k,i} - {POC}_{current}} \right) -}} \\{\left( {{POC}_{m,j} - {POC}_{previous}} \right)} \\{= {\left( {{POC}_{k,i} - {POC}_{m,j}} \right) +}} \\{\left( {{POC}_{previous} - {POC}_{current}} \right)} \\{= {\left( {{POC}_{k,i} - {POC}_{m,j}} \right) + {\Delta \; {BD}_{k}}}}\end{matrix} & (3)\end{matrix}$

When the aforementioned condition (a) is satisfied, POC_(m,j) is inBD[m] and, therefore, an identifier (or index) to ΔPOC_(m,j) to make(POC_(k,i)−POC_(m,j)) zero is encoded. In the present embodiment, theidentifier Δidx_(k,i) defined below is used.

Δidx_(k,i)=offset_(k,i)−offset_(k,i−1)   (4)

In this case, offset_(k,i)=j−i and offset_(k,−1)=0. Since ΔBD_(k)defined in above formula (3) is constant irrespective of the values of(i, j), it is only necessary to describe AΔBD_(k) defined below, once inBD[k].

ΔBD_(k)=POC_(previous)−POC_(current)   (5)

On the other hand, there is a situation where ΔPOC_(m,j) to make(POC_(k,i)−POC_(m,j)) zero, is absent in BD[m]. For example, thecomponent POC_(1,2)=32 (cell 1620) in FIG. 16 is not present as areference picture in row 1610. In this case, the value of ΔPOC_(k,i) maybe encoded as it is, but when the aforementioned condition (d) isapplied, ΔPOC_(k,i)=ΔBD_(k) and this value is already described inBD[k]; therefore, there is no need for encoding it again. The value ofthe number of components of BD[m] (i.e., #ΔPOC_(m)), or a value largerthan the number of components of BD[m], is set as the value of j toindicate that there is no identical POC number in BD[m]. A decodingmethod of ΔPOC_(k,i) using the value of j in future decoding will bedescribed later.

As for the dependence information D_ID_(k,i) which each referencepicture has, if the reference picture exists in BD[m] used for theprediction, there is no need for encoding thereof because the dependenceinformation D_ID_(k,i) is equal to D_ID_(m,j). On the other hand, if thereference picture does not exist in the BD[m] which is used for theprediction, the dependence information D_ID_(k,i) is encoded.

The contents (syntaxes) of 822, 824 in FIG. 8 are configured based onthe above-described conception and the processes of block 360 in FIG. 3,and block 460 in FIG. 4, which will be explained based on thisconception.

FIG. 6 is a flowchart showing an example of the encoding process of thebuffer description information (the process of block 360 in FIG. 3) inthe video predictive encoding device 100 according to an embodiment.This process corresponds to the encoding process of BD[k] in the case ofk>0 in FIG. 8. Step 610 is to encode the number of components of BD[k],i.e., to encode the number #ΔPOC_(k) of reference pictures described.Then ΔBD_(k) is calculated (step 620) and then it is encoded (step 630).Thereafter, the following process is carried out for each component ofBD[k]. Step 640 is to detect whether there is ΔPOC_(m,j) sharing thesame reference picture with ΔPOC_(k,i) (i.e., POC_(m,j)=POC_(k,i)) inBD[m] (m=k−1). When it is determined in step 645 that it is present, theprocessing proceeds to step 650 to determine and then encode the valueof Δidx_(k,i) according to above formula (4). When it is determined instep 645 that it is absent, the processing proceeds to step 655. Step655 is to set the value of the number (#ΔPOC_(m)) of components of BD[m]in the value j. The set value may be a value larger than it. Step 660 isto determine the value of Δidx_(k,i) according to above formula (4) andthen encode it. Step 670 is to encode the dependence informationD_ID_(k,i) of the reference picture. Each of the foregoing values isconverted to a binary code and then it is encoded by arithmetic coding,but any other entropy encoding method may be applied. Theabove-described processing is repeatedly carried out up to the lastcomponent of BD[k].

FIG. 5 shows an example of the result obtained by processing the bufferdescription information in conventional technology such as in theexample shown in FIG. 17, by the aforementioned method. Column 501represents the identifier of each BD[k] and in the present embodiment itis not explicitly encoded. Column 502 represents the number ofcomponents of each BD[k] and column 504 data for describing thereference pictures of BD[k]. Row 510 corresponds to BD[0] and is encodedusing the values of ΔPOC_(k,i). Row 511 and subsequent rows representvalues of Δidx_(k,i). Column 505 represents the identifier of each BD[m]used for the prediction, but since m=k−1 in the present embodiment,there is no need for encoding it. Column 506 represents ΔBD_(k). Each ofentries in cells 520-523 corresponds to a situation where there is noidentical reference picture in BD[m] used for the prediction and it isnecessary to encode D_ID_(k,i), in addition to Δidx_(k,i); butillustration of the encoding of D_ID_(k,i) is omitted from FIG. 5. Mostof the values in the respective cells under 504 in FIG. 5 are “0” andthe values and dynamic range are smaller than those of the informationin conventional technology such as the example shown in FIG. 17, thusachieving the effect of efficient encoding. The conventional technologyneeds to encode D_ID_(k,i) of all components, whereas the method of thepredictive video coding system encodes D_ID_(k,i) for only limitedcomponents, so as to further reduce the bit count.

FIG. 7 is a flowchart showing an example of the decoding process of thebuffer description information (the process of block 460 in FIG. 4) inthe video predictive decoding device 200 according to an embodiment.This process corresponds to the decoding process of BD[k] in the case ofk>0 in FIG. 8. Step 710 is to decode the number of components of BD[k],i.e., to decode the number #ΔPOC_(k) of reference pictures described.Step 730 is to decode ΔBD_(k). The below-described decoding processingis then carried out for each of the components of BD[k]. Step 740 is todecode Δidx_(k,i) and then the value of index j is determined using thefollowing formula (step 745).

j=i+Δidx_(k,i)+offset_(k,i−1), (6)

where offset_(k−1)=0

Using this index j, it is determined in step 750 whether ΔPOC_(m,j) as areference value of ΔPOC_(k,i) of a decoding target is present in BD[m].If j<the number (#ΔPOC_(m)) of components of BD[m], ΔPOC_(m,j) ispresent; if j≥(#ΔPOC_(m)), ΔPOC_(m,j) is absent. When it is determinedin step 750 that it is present, the processing proceeds to step 760 todetermine the value of ΔPOC_(k,i). The dependence information D_ID_(k,i)is simply a copy of that of ΔPOC_(m,j). It should be noted herein thatthere is no need for encoding of the dependence information D_ID_(k,i).When it is determined in step 750 that it is absent, the processingproceeds to step 765. In this step, the dependence informationD_ID_(k,i) is decoded and ΔBD_(k) is substituted for the value ofΔPOC_(k,i) in step 770. The above processing is repeatedly carried outup to the last component of BD[k].

As described above, the encoding and decoding methods of bufferdescription information make use of the property of repetitive use ofreference pictures and make use of the correlation between pieces ofbuffer description information BD[k] used for different pictures, tocompact or eliminate redundant information, thereby achieving theefficient encoding of buffer description information.

As shown in the example of FIG. 16, the information about the buffer isarranged in the sequence of encoding and decoding of target pictures.For this reason, the aforementioned conditions (a) to (d) are met andthe above-described embodiment allows the buffer description informationto be encoded by the most efficient method. On the other hand, the orderof buffer descriptions is arbitrary, and each BD[k] may be described inan order different from that shown in FIG. 16. The below will describe adifferent embodiment, which may provide additional versatility.

In the example of FIG. 9 the buffer information is described in an orderslightly different from that in FIG. 16. The difference from FIG. 16 isthat the buffer information about POC=25 (913) is described prior toPOC=30 (914). However, the reference pictures used are the same as inthe case of FIG. 16. In this example, the target picture with POC=25(913) uses the reference pictures with POC=22, 24, 32, 28, 26, and 30,and the target picture with POC=26 (912) located immediately above ituses the reference pictures with POC=22, 24, 32, and 28. If the bufferdescription information BD[m] in row 912 is used for the prediction ofthe buffer description information BD[k] in row 913, the component withPOC=30 (963) belonging to BD[k] is absent in BD[m] and thus is notgenerated by use of BD[m]. For example, when the aforementionedcondition (c) (m=k−1) is used, the aforementioned condition (d) is notsatisfied.

In order to solve this problem, the aforementioned condition (c) isrelieved so as to allow free selection of BD[m] and, in turn, an index mto identify BD[m] used for the prediction is encoded. In that case, whenthe buffer description information in row 914 is used as BD[m] for theprediction of the buffer description information BD[k] in row 913, FIG.6 and FIG. 7 can be applied as they are (provided that encoding anddecoding of the index m are added).

As another method, it is also possible to adopt a method of encoding thePOC number ΔPOC_(k,i) in aforementioned formula (1) as it is, for anadditional reference picture absent in BD[m] used for the prediction,or, to adopt a method of encoding a difference between ΔPOC_(k,i) andΔBD_(k) as IBDR_(k,i).

IBDR_(k,i)=ΔPOC_(k,i)−ΔBD_(k)   (7)

When the above formula (7) is expanded, it is equal to(POC_(k,i)−POC_(previous)). FIG. 12 shows a schematic diagram of anexample of buffer description information described in a PPS created bythe aforementioned embodiment which may provide more versatility. InFIG. 12 numeral 1211 is the same as 811 in FIG. 8 and numeral 1220 thesame as 820. BD[k] in the case of k>1 is transmitted in the syntaxrepresented by 1222 or 1224. The syntax in this case is composed of thenumber of components of BD[k] (which is the number of reference picturesnecessary for the target picture and subsequent pictures) #ΔPOC_(k)(1233, 1240), the identifier m_(k) (1234, 1241) of the bufferdescription information used for the prediction, ΔBD_(k) (1235, 1242),and, Δidx_(k,i) (1236, 1237, 1243, 1244) or {Δidx_(k,i), D_ID_(k,i),IBDR_(k,i)} (1238, 1239, 1245, 1246).

The buffer description information shown in FIG. 12 is encoded anddecoded as follows. FIG. 10 is a flowchart showing an example of themore versatile encoding process of buffer description information (theprocess of block 360 in FIG. 3) in the video predictive encoding device100 according to an embodiment. This process corresponds to the encodingprocess of BD[k] in the case of k>0 in FIG. 12. Step 1010 is to encodethe number of components of BD[k], i.e., to encode the number #ΔPOC_(k)of reference pictures described. The next step is to determine thebuffer description information BD[m] for reference used in theprediction, to specify the identifier m_(k) thereof, and, atsubstantially the same time, to calculate ΔBD_(k) (step 1020). Step 1030is to encode m_(k) and ΔBD_(k). Then the following processing is carriedout for each of the components of BD[k]. Step 1040 is to detect whetherΔPOC_(m,j) is sharing the same reference picture with ΔPOC_(k,i) (i.e.,POC_(m,j)=POC_(k,i)) is present in BD[m_(k)]. When it is determined instep 1045 that it is present, the processing proceeds to step 1050 todetermine the value of Δidx_(k,i) according to the aforementionedformula (4) and then encode it. When it is determined in step 1045 thatit is absent, the processing proceeds to step 1055. Step 1055 is to seta value not less than the value of the number (#ΔPOC_(m)) of componentsof BD[m], in the index j. In this case, a value not yet used for thesetting is set as the value of the index j, in order to adapt for apossibility of presence of one or more additional reference pictures(absent in BD[m]). Step 1060 is to determine the value of Δidx_(k,i)according to the aforementioned formula (4) and then encode it. Step1070 is to determine the value of IBDR_(k,i) according to theaforementioned formula (7) and then encode it together with thedependence information D_ID_(k,i) of the reference picture. Each of theforegoing values is converted to a binary code and encoded by arithmeticcoding, but any other entropy encoding method may be applied. The aboveprocessing is repeatedly carried out up to the last component of BD[k].

FIG. 21 shows an example result of the processing obtained by convertingthe buffer description information in the example of FIG. 9 intoΔPOC_(k,i) shown in FIG. 20 and then processing it by theabove-described more versatile method. Column 941 represents theidentifier of each BD[k]. Column 942 represents the number of componentsof each BD[k] and column 944 the data for description of the referencepictures of BD[k]. Row 950 corresponds to BD[0] and is encoded by thevalues of ΔPOC_(k,i). Row 951 and subsequent rows are encoded byΔidx_(k,i) or {Δidx_(k,i), D_ID_(k,i), IBDR_(k,i)} (D_ID_(k,i) isomitted in FIG. 21). Column 945 represents the identifier m_(k) of BD[m]used for the prediction. Column 946 represents ΔBD_(k). Each of entriesin cells 980-983 corresponds to a situation where there is no identicalreference picture in BD[m] used in the prediction and where {Δidx_(k,i),D_ID_(k,i), IBDR_(k,i)} is encoded. Most of the values in the respectivecells under 944 in FIG. 21 are “0” and the values and dynamic range aresmaller than those of the information in conventional technology, suchas in the example of FIG. 20, thus achieving the effect of efficientencoding.

FIG. 11 is a flowchart showing an example of the more versatile decodingprocess of buffer description information (the process of block 460 inFIG. 4) in the video predictive decoding device 200 according to anembodiment. This process corresponds to the decoding process of BD[k] inthe case of k>0 in FIG. 12. Step 1110 is to decode the number ofcomponents of BD[k], i.e., to decode the number #ΔPOC_(k) of referencepictures described. Step 1130 is to decode m_(k) and ΔBD_(k). Then thefollowing decoding processing is carried out for each of the componentsof BD[k]. Step 1140 is to decode Δidx_(k,i) and then the value of indexj is determined using the aforementioned formula (6) (step 1145).

Using this index j, it is determined in step 1150 whether ΔPOC_(m,j) asa reference value of ΔPOC_(k,i) of a decoding target is present inBD[m]. In this example, if j<the number (#ΔPOC_(m)) of components ofBD[m], ΔPOC_(m,j) is present; if j≥(#ΔPOC_(m)), ΔPOC_(m,j) is absent.When it is determined in step 1150 that it is present, the processingproceeds to step 1160 to determine the value of ΔPOC_(k,i). Thedependence information D_ID_(k,i) can be simply a copy of that owned byΔPOC_(m,j). When it is determined in step 1150 that it is absent, theprocessing proceeds to step 1165. In this step, IBDR_(k,i) and thedependence information D_ID_(k,i) are decoded and the value ofΔPOC_(k,i) is calculated in step 1170. The foregoing processing isrepeatedly carried out up to the last component of BD[k].

As described above, the encoding and decoding methods of bufferdescription information according to the predictive video coding systemmake use of the property of repetitive use of reference pictures andmake use of the correlation between pieces of buffer descriptioninformation BD[k] used for different pictures, so as to compactredundant information, thereby enabling the efficient encoding of bufferdescription information. In addition, there is the effect of efficientencoding even in the case where cross reference to buffer descriptioninformation is freely made.

The example encoding processes of FIG. 6 and FIG. 10 or the exampledecoding processes of FIG. 7 and FIG. 11 were described separately, butthese two embodiments may be used in combination. In the decodingprocesses, the steps 765, 770 in FIG. 7 are different from the steps1165, 1170 in FIG. 11, but when they are used in combination, it is onlynecessary to add information (1 bit) for identification of theseprocesses and encode it.

Since the values of Δidx_(k,i) all are zero as seen in rows 512, 513,514, and 517 in FIG. 5, those values can be represented by one signal(flag), instead of individually encoding them.

In the above embodiments, the POC number of each reference picturedescribed in the buffer description information is converted intoΔPOC_(k,i) and then the buffer description information is encoded anddecoded, but the method may be applied to the POC number itself. Forexample, when the POC number in the buffer description information BD[k]as a target is present in BD[m] used for the prediction, Δidx_(k,i)indicating the POC number is encoded. When the desired POC number isabsent in BD[m], ΔPOC_(k,i) obtained by the aforementioned formula (1)is encoded as IBDR_(k,i). Formula (7) may be used instead of theaforementioned formula (1). In this case the process of block 360 inFIG. 3 is as shown in FIG. 18 and the process of block 460 in FIG. 4 isas shown in FIG. 19. FIG. 18 is much the same as the processing of FIG.10, and FIG. 19 much the same as the processing of FIG. 11; FIG. 18 andFIG. 19 employ step numbers with “S” attached to the step numbers of thecorresponding process steps in FIG. 10 and FIG. 11. It is, however,noted that the processing is carried out for POC instead of ΔPOC. Inthis case ΔBD_(k) is zero and thus it does not have to be encoded anddecoded. Then, if m=(k−1) is fixed (i.e., in the case of the predictionfrom immediately previous BD[m]), m_(k) does not have to be encoded ordecoded, either.

In the above embodiments, when bd_(k,i) represents the i-th component ofthe buffer description BD[k] as a target and bd_(m,j) a component ofBD[m] used for the prediction, Δidx_(k,i) can be considered to be arelative position (index or address) of bd_(m,j) from bd_(k,i). Forexample, supposing that bd_(k,i) and bd_(m,j) are information storageplaces, their POC numbers may be stored in the information storageplaces or values of ΔPOC may be stored therein. In this case, Δidx_(k,i)is treated as a relative position between the information storage places(provided that their contents include the POC numbers used in common).In other words, the buffer description is a description of thepositional relationship between the information storage place forstorage of the buffer information of the target picture and theinformation storage place for storage of the buffer information as areference for the target picture and provides a switching method forreproduction methods of the contents of bd_(k,i) by comparing theposition (j) of the designated information storage place with the number(#ΔPOC_(m) or #POC_(m)) of information storage places containing theircontents.

Another embodiment as described below is also applicable to the encodingand decoding methods of buffer description information of the predictivevideo coding system. The present embodiment is based on theaforementioned conditions (c) and (d), similar to the embodiment shownin FIG. 6 and FIG. 7. For example, the buffer description informationBD[m] is used for the prediction of the buffer description informationBD[k] as a target, and the BD immediately previous to BD[k] is used asBD[m]. That is, m=(k=1). There is only one additional reference picturein BD[k] and this additional reference picture is generated in the caseof BD[m] being used.

Under these conditions, the present embodiment is one wherein it isdetermined in encoding the information of the buffer description BD[k]as a target, whether ΔPOC_(m,j) in BD[m], which is used for theprediction shares an identical reference picture with ΔPOC_(k,I), whichis a component of BD[k] (i.e., POC_(m,j)=POC_(k,i)) is “present or not”.Therefore, the aforementioned embodiment employed the “relative positionΔidx_(k,i),” whereas the present embodiment employs a flag simplyindicative of “present or not.” This flag is described as ibd_flag_(k,j)herein. When the flag ibd_flag_(k,j) indicates “present,” the j-thpicture already stored in the buffer is continuously used as a referencepicture. On the other hand, when the flag ibd_flag_(k,j) indicates“not,” another designated picture is stored as a new reference picture(additional reference picture) into the buffer.

Under the conditions (c) and (d), the number of BD[k] is at most onelarger than the number of BD[m]; i.e., the relation of#ΔPOC_(k)=#ΔPOC_(m)+1 is always met, and therefore there is no need fortransmission of #ΔPOC_(k). For this reason, the present embodiment canfurther reduce the bit count.

FIG. 22 shows an example of the encoding process of buffer descriptioninformation according to the present embodiment based on the aboveconcept. This process applies to the process of step 360 in FIG. 3. Step2210 is to derive information about the number of ΔPOC_(k) and thenumber of ΔPOC_(m), which are used for a subsequent determination. Step2220 is to obtain ΔBD_(k) given by formula (5) and encode ΔBD_(k). Forexample, ΔBD_(k) is obtained as a difference between the POC numberPOC_(current) of the target picture using the information of BD[k] andthe POC number POC_(previous) of the picture using the information ofBD[m] used for the prediction of BD[k]. Step 2230 is to initialize thecounter i of BD[k] and the counter j of BD[m] to zero.

Next, steps 2240 to 2265 are to check the components of BD[m] as many asthe number of ΔPOC_(m). Specifically, when the condition of step 2245 issatisfied, the processing proceeds to step 2250; otherwise, theprocessing proceeds to step 2260. Specifically, the condition of step2245 is given by formula (3) and corresponds to the case of(POC_(k,i)=POC_(m,j)). Step 2250 is to encode ibd_flag_(k,j) of 1 forindicating that the condition is met, or “present.” At substantially thesame time, the counter i of BD[k] is given an increment. On the otherhand, step 2260 is to encode ibd_flag_(k,j) of 0 for indicating that thecondition is “not” met. Step 2265 is to give the count j an increment,for checking the next BD[m].

When the condition of step 2240 is not satisfied, i.e., when the checkis completed for all the components of BD[m], the processing proceeds tostep 2270. This step is to compare the number of ΔPOC_(k) with thecounter i of buffer description information BD[k] as a target. Since thecounter i of BD[k] starts counting from 0, its maximum is (the number ofΔPOC_(k)−1). If the condition of (i=the number of ΔPOC_(k)) is satisfiedin step 2270, the counter i exceeds the number of components of BD[k]and ibd_flag_(k,j) is set to 0 to be encoded, followed by end ofprocessing. On the other hand, if the condition of (i=the number ofΔPOC_(k)) is not satisfied in step 2270, it is meant thereby that anadditional reference picture absent in BD[m] is stored into the buffer.For encoding information about it, step 2290 is to encode ibd_flag_(k,j)of 1 and step 2295 is to encode the dependence information D_ID_(k,i) ofthe additional reference picture. Since the value of ΔPOC_(k,i) of theadditional reference picture is ΔBD_(k) as described with FIG. 6, itdoes not have to be encoded.

FIG. 24 shows an example of a data arrangement of buffer descriptioninformation described in a PPS generated as described above. FIG. 24 issimilar to FIG. 8. “The number of BDs” indicated by 2411 is the same as811 in FIG. 8, the information 2420 about BD[0] being the first BD isthe same as 820 in FIG. 8, and they are generated in step 320 and step330, respectively, in FIG. 3.

The information contained in BD[k] in the case of k>0 is exemplified by2422 and 2424 in FIG. 24. The contents described therein are ΔBD_(k)(2434, 2440) and, ibd_flag_(k,j) (2435, 2436, 2437, 2441, 2442, 2443,2444) or {ibd_flag_(k,j), D_ID_(k,j)} (2438). This data structure(syntax) is similar to FIG. 8 and it is noted that #ΔPOC_(k) (833, 839)representing the number of BD[k] in the case of k>0 is not needed.ibd_flag_(k,j) takes a value of 1 or 0. Since the information about thenumber of BD[k] does not have to be encoded, there is an effect ofpermitting the buffer description information to be expressed by asmaller bit count.

FIG. 23 shows an example of another implementation method of thedecoding process of buffer description information according to thepresent embodiment. Step 2310 is to derive the number (#ΔPOC_(m)) ofΔPOC_(m) being the components of BD[m] used for the prediction. Thenumber (#ΔPOC_(m)) of ΔPOC_(m) is obtained by counting the number ofcomponents while reconstructing BD[m]. Step 2320 is to initialize thecounter i of BD[k] and the counter j of BD[m] to zero. Step 2330 is todecode the value of ΔBD_(k) described in the buffer information.Subsequently, ibd_flag_(k,j) is decoded as many times as the number(#ΔPOC_(m)+1) (under control by step 2345). The processes of step 2345and subsequent steps are carried out based on the decoded values ofibd_flag_(k,j).

Step 2345 is to judge the counter j of BD[m]. Before the counter jreaches the number of ΔPOC_(m), whether ΔPOC_(k,i) is to bereconstructed using ΔPOC_(m,j) is determined, based on the value ofibd_flag_(k,j) (1 or 0) (step 2350). When the value of ibd_flag_(k,j) is1, step 2355 is carried out to add ΔBD_(k) to ΔPOC_(m,j) to generateΔPOC_(k,i). In this case, ΔPOC_(k,i) and ΔPOC_(m,j) share the samereference picture (POC_(m,j)=POC_(k,i)), and therefore the dependenceinformation D_ID_(k,i) can be simply a copy of the dependenceinformation D_ID_(m,j) related to ΔPOC_(m,j). Next, the counter i ofBD[k] is given an increment and then a determination on the nextcomponent of BD[m] is made.

After the check is completed up to the last component of BD[m] (or whenstep 2345 results in NO), the value of last ibd_flag_(k,j) is judged(step 2370). When ibd_flag_(k,j)=0, it is meant thereby that there is noadditional reference picture, and the flow goes to below-described step2390, without any processing. On the other hand, in the case ofibd_flag_(k,j)=1, it is meant thereby that there is an additionalreference picture (which is absent in BD[m]), and then step 2375 iscarried out to reconstruct the dependence information D_ID_(k,i). Step2380 uses ΔBD_(k) as the POC number of the additional reference picture(because the condition (d) is applied). Furthermore, the counter i ofBD[k] is given an increment. Finally, the value counted by the counter iis stored as the number of BD[k] (step 2390). This number of BD[k] isused for generation of each component of BD[k+1] (in step 2310).

The example processing methods of FIG. 22 and FIG. 23 are theimplementation methods where there is only one additional referencepicture in BD[k], and in the case where there are N additional referencepictures, the value of N can be transmitted and received as part of theinformation of BD[k]. In this case, the POC numbers of the additionalreference pictures are encoded and decoded using IBDR_(k,i).Specifically, step 2295 in FIG. 22 can be configured to perform the sameprocess as step 1070 in FIG. 10, step 2375 in FIG. 23 can be configuredto perform the same process as step 1165 in FIG. 11, and step 2380 inFIG. 23 can be configured to perform the same process as step 1170 inFIG. 11.

In the above example the values of ibd_flag_(k,j) are expressed by onebit (1 or 0), but they may be expressed by two or more bits. In thiscase, the additional bit or bits may be used to determine whether theother information (D_ID_(k,i), IBDR_(k,i), or other information) isexplicitly encoded.

Furthermore, the additional bit may be used to indicate an applicationrange of the reference pictures associated with ΔPOC_(k,i) (i.e., thereference pictures having the POC numbers of POC_(k,i) given in formula(1)). Specifically, when ibd_flag_(k,j) is “1,” ΔPOC_(k,i) isreconstructed using ΔPOC_(m,j) and, at substantially the same time, thereference picture associated with ΔPOC_(k,i) is applied to the pictureas a current processing target (current picture) and a future picturesubsequent thereto (a future picture or future pictures). Whenibd_flag_(k,j) is “01,” ΔPOC_(k,i) is reconstructed using ΔPOC_(m,j)and, at substantially the same time, the reference picture associatedwith ΔPOC_(k,i) is not applied to the picture as a current processingtarget (current picture) but is applied to only a future picturesubsequent thereto (a future picture or future pictures). Furthermore,when ibd_flag_(k,j) is “00,” ΔPOC_(m,j) is not used for reconstructionof ΔPOC_(k,i).

In the above embodiments the processing is carried out for ΔPOC_(k,i)described in the buffer description information, but the processing maybe carried out for the POC number itself owned by each referencepicture.

The buffer description information was described in all the aboveembodiments. Since the buffer description information is alsodescriptions about a plurality of reference pictures used for encodingand decoding of the target picture, the foregoing embodiments may alsobe used as methods for management of reference picture lists.

The above embodiments explained the cases where the buffer descriptioninformation was encoded together as part of the PPS information, butthey are also applicable to cases where the buffer descriptioninformation is described in the header of each individual targetpicture. For example, they are also applicable to a configurationwherein the information of row 510 in FIG. 5 is described in the lead(header) of compressed data of the picture with POC=32 and theinformation of row 511 is described in the lead (header) of compresseddata of the picture with POC=28. In this case, the buffer descriptioninformation BD[k] belonging to the target picture k can be encoded anddecoded by the example processes of FIGS. 6, 7, 10, 11, 18, and 19, withreference to the buffer description information BD[m] belonging to thepicture m processed previously. However, there are cases where thetarget picture m is not used as a reference picture at all (where thevalue of dependence information D_ID is large), depending upon theprediction structure, and BD[m] belonging to the picture m is not usedfor the prediction in such cases. The reason for it is that the picturem not used as a reference picture at all can be discarded in order tocontrol the data volume and lighten the decoding process.

A video predictive encoding program for letting a computer function asthe foregoing video predictive encoding device 100 can be provided asstored in a recording medium. Similarly, a video predictive decodingprogram for letting a computer function as the foregoing videopredictive decoding device 200 can be provided as stored in a recordingmedium. Examples of such recording media include recording media such asflexible disks, CD-ROM, DVD, or ROM, or semiconductor memories or thelike.

FIG. 13 is a drawing showing an example of a hardware circuitryconfiguration of computer 30 for executing a program recorded in arecording medium, and FIG. 14 is a drawing showing an example of aperspective view of computer 30 for executing a program stored in arecording medium. The example computer 30 herein can generally embrace aDVD player, a set-top box, a cell phone, and other devices provided withcircuitry that includes a CPU and is configured to perform informationprocessing and control based on the circuitry or circuitry and software.

As shown in FIG. 13, the computer 30 is provided with circuitry thatincludes a reading device 12 such as a flexible disk drive unit, aCD-ROM drive unit, or a DVD drive unit, a communication port such as auniversal serial bus port (USB), Bluetooth port, an infraredcommunication port, or any other type of communication port that allowscommunication with an external device, such as another computer ormemory device. The computer 30 may also include a working memory 14 thatmay include an operating system, a memory 16 that stores data, such asat least part of a program such as a program stored in the recordingmedium 10. In addition, the working memory 14 and/or the memory 16 mayinclude the memory 104 and the memory 207. The working memory 14 andmemory 16 may be one or more computer readable storage medium that isother than a transitory signal, and can include a solid-state memorysuch as a memory card or other package that houses one or morenon-volatile memories, such as read-only memories. Further, the computerreadable medium can include a random access memory or other volatilere-writable memory. Additionally or alternatively, the computer-readablemedium can include a magneto-optical or optical medium, such as a diskor tapes or any other non-transitory information storage medium tocapture carrier wave signals such as a signal communicated over atransmission medium. A digital file attachment to an e-mail, stored in astorage medium, or other self-contained information archive or set ofarchives may be considered a non-transitory distribution medium that isa tangible computer readable storage medium. Accordingly, theembodiments are considered to include any one or more of acomputer-readable storage medium or a non-transitory distributionstorage medium and other equivalents and successor information storagemedia, in which data or instructions may be stored. In addition, thecomputer 30 may have user interface circuitry that includes a monitordevice 18 such as a display, a mouse 20 and a keyboard 22 as inputdevices, a touch screen display, a microphone for receipt of voicecommands, a sensor, or any other mechanism or device that allows a userto interface with the computer C10. In addition, the circuitry of thecomputer 30 may include a communication device 24 for transmission andreception of data and others, and a central processing unit (CPU) 26, orprocessor to control execution of the program. The processor 26 may beone or more one or more general processors, digital signal processors,application specific integrated circuits, field programmable gatearrays, digital circuits, analog circuits, combinations thereof, and/orother now known or later developed circuitry and devices for analyzingand processing data. In an example, when the recording medium 10 is putinto the reading device 12, the computer 30 becomes accessible to thevideo predictive encoding program stored in the recording medium 10,through the reading device 12, and becomes able to operate as theaforementioned video predictive encoding device 100 based on the videopredictive encoding program. Similarly, in an example when the recordingmedium 10 is put into the reading device 12, the computer 30 becomesaccessible to the video predictive decoding program stored in therecording medium 10, through the reading device 12, and becomes able tooperate as the foregoing video predictive decoding device 200 based onthe video predictive decoding program.

LIST OF REFERENCE SIGNS

100: video predictive encoding device; 101: input terminal; 102: blockdivision unit; 103: predicted signal generation unit; 104: frame memory(or buffer, DPB); 105: subtraction unit; 106: transform unit; 107:quantization unit; 108: inverse quantization unit; 109: inversetransform unit; 110: addition unit; 111: entropy encoding unit; 112:output terminal; 114: buffer management unit; 200: video predictivedecoding device; 201: input terminal; 202: data analysis unit; 203:inverse quantization unit; 204: inverse transform unit; 205: additionunit; 206: output terminal; 207: frame memory; 208: predicted signalgeneration unit; 209: buffer management unit.

What is claimed is:
 1. A video predictive decoding method executed by avideo predictive decoding device, comprising: an input step of inputtingcompressed picture data for each of a plurality of pictures constitutinga video sequence, the compressed picture data containing data resultingfrom predictive coding using a plurality of reference pictures, whichhave been decoded and reproduced in the past, and encoded data of bufferdescription information BD[k] related to the plurality of referencepictures; a reconstruction step of decoding the compressed picture datato reconstruct a reproduced picture; a picture storage step of storingat least one said reproduced picture as a reference picture to be usedfor decoding of a subsequent picture; and a buffer management step ofcontrolling the picture storage step, wherein, prior to reconstructionof the reproduced picture, the buffer management step comprisesdecoding, with reference to buffer description information BD[m] foranother picture different from the reproduced picture, the encoded dataof the buffer description information BD[k] for the reproduced picture,and then controlling the picture storage step on the basis of thedecoded buffer description information BD[k], wherein the decoding ofthe encoded data of the buffer description information BD[k] for thereproduced picture includes: decoding an index m identifying the bufferdescription information BD[m] for another picture different from thereproduced picture, decoding a value of deltaBD representing adifference between identification information of the correspondingreference pictures in the BD[m] and the BD[k], decoding a plurality offlags ibd_flag[j] indicating both whether or not an identificationinformation of a j-th reference picture included in the BD[m] is usedfor decoding an identification information of a reference pictureincluded in the BD[k] and whether or not the j-th reference pictureincluded in the BD[m] is used for decoding a current processing targetpicture, and decoding an information on the reference picture in theBD[k] based on the decoded index m, the decoded value of deltaBD and thedecoded flags ibd_flag[j], wherein, when the ibd_flag[j] indicates thatan information on the j-th reference picture included in the BD[m] isused for decoding an information on the reference picture included inthe BD[k], a deltaPOC[i] that is an identification information of thei-th reference picture included in the BD[k] is derived by adding thevalue of deltaBD to a deltaPOC[j] that is an identification informationof the j-th reference picture included in the BD[m], and wherein, when jis equal to the number of reference pictures included in the BD[m], thedeltaPOC[i] that is the identification information of the i-th referencepicture included in the BD[k] is set to the value of deltaBD.
 2. A videopredictive decoding device comprising: input means which inputscompressed picture data for each of a plurality of pictures constitutinga video sequence, the compressed picture data containing data resultingfrom predictive coding using a plurality of reference pictures, whichhave been decoded and reproduced in the past, and encoded data of bufferdescription information BD[k] relating to the plurality of referencepictures; reconstruction means which decodes the compressed picture datato reconstruct a reproduced picture; picture storage means which storesat least one said reproduced picture as a reference picture to be usedfor decoding of a subsequent picture; and buffer management means whichcontrols the picture storage means, wherein, prior to reconstruction ofthe reproduced picture, the buffer management means decodes, withreference to buffer description information BD[m] for another picturedifferent from the reproduced picture, the encoded data of the bufferdescription information BD[k] for the reproduced picture, and thencontrols the picture storage means on the basis of the decoded bufferdescription information BD[k], wherein the decoding of the encoded dataof the buffer description information BD[k] for the reproduced pictureincludes: decoding an index m identifying the buffer descriptioninformation BD[m] for another picture different from the reproducedpicture, decoding a value of deltaBD representing a difference betweenidentification information of the corresponding reference pictures inthe BD[m] and the BD[k], decoding a plurality of flags ibd_flag[j]indicating both whether or not an identification information of a j-threference picture included in the BD[m] is used for decoding anidentification information of a reference picture included in the BD[k]and whether or not the j-th reference picture included in the BD[m] isused for decoding a current processing target picture, and decoding aninformation on the reference picture in the BD[k] based on the decodedindex m, the decoded value of deltaBD and the decoded flags ibd_flag[j],wherein, when the ibd_flag[j] indicates that an information on the j-threference picture included in the BD[m] is used for decoding aninformation on the reference picture included in the BD[k], adeltaPOC[i] that is an identification information of the i-th referencepicture included in the BD[k] is derived by adding the value of deltaBDto a deltaPOC[j] that is an identification information of the j-threference picture included in the BD[m], and wherein, when j is equal tothe number of reference pictures included in the BD[m], the deltaPOC[i]that is the identification information of the i-th reference pictureincluded in the BD[k] is set to the value of deltaBD.